Improved resolvent bounds for radial potentials. II
نویسندگان
چکیده
We prove semiclassical resolvent estimates for the Schrödinger operator in $${\mathbb {R}}^d$$ , $$d\ge 3$$ with real-valued radial potentials $$V\in L^\infty ({\mathbb {R}}^d)$$ . show that if $$V(x)={\mathcal O}\left( \langle x\rangle ^{-\delta }\right) $$ $$\delta >4$$ then bound is of form $$\exp \left( Ch^{-\frac{\delta }{\delta -1}}\left( \log (h^{ -1})\right) ^{\frac{1}{\delta -1}}\right) some constant $$C>0$$ If e^{-{\widetilde{C}}\langle ^{\alpha }}\right) $${\widetilde{C}},\alpha >0$$ we get better bounds Ch^{-1}\left( (h^{-1})\right) ^{\frac{1}{\alpha
منابع مشابه
Eigenvalue Bounds for Schrödinger Operators with Complex Potentials. Ii
Laptev and Safronov conjectured that any non-positive eigenvalue of a Schrödinger operator −∆ + V in L(R) with complex potential has absolute value at most a constant times ‖V ‖ γ+ν/2 for 0 < γ ≤ ν/2 in dimension ν ≥ 2. We prove this conjecture for radial potentials if 0 < γ < ν/2 and we ‘almost disprove’ it for general potentials if 1/2 < γ < ν/2. In addition, we prove various bounds that hold...
متن کاملImproved error bounds for scattered data interpolation by radial basis functions
If additional smoothness requirements and boundary conditions are met, the well–known approximation orders of scattered data interpolants by radial functions can roughly be doubled.
متن کاملImproved bounds for stochastic matching
This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.
متن کاملImproved Bounds for Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Comput. Sys. Sci., 2004 ) showed that Õ(k)/ queries are sufficient to test k-juntas, and conjectured that this bound is optimal for non-adaptive testing algorithms. Our main result is a non-adaptive algorithm for testin...
متن کاملImproved Bounds Computation for Probabilistic
Probabilistic is a direct extension of the structured singular value from the worst-case robustness analysis to the probabilistic framework. Instead of searching for the maximum of a function in the computation, computing probabilistic involves approximating the level surface of the function in the parameter space, which is even more complex. In particular, providing a suuciently tight upper bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2022
ISSN: ['0003-889X', '1420-8938']
DOI: https://doi.org/10.1007/s00013-022-01771-9